Discrete search and the Neyman-Pearson Lemma
نویسندگان
چکیده
منابع مشابه
Generalized Neyman - Pearson Lemma
We extend the classical Neyman-Pearson theory for testing composite hypotheses versus composite alternatives, using a convex duality approach as in Witting (1985). Results of Aubin & Ekeland (1984) from non-smooth convex analysis are employed, along with a theorem of Komll os (1967), in order to establish the existence of a max-min optimal test and to investigate its properties. The theory is i...
متن کاملGeneralized Neyman-pearson Lemma via Convex Duality
We extend the classical Neyman-Pearson theory for testing composite hypotheses versus composite alternatives, using a convex duality approach as in Witting (1985). Results of Aubin & Ekeland (1984) from non-smooth convex analysis are employed, along with a theorem of Komlós (1967), in order to establish the existence of a max-min optimal test in considerable generality, and to investigate its p...
متن کاملA Generalized Neyman-Pearson Lemma for g-Probabilities
This paper is concerned with hypothesis tests for g-probabilities, a class of nonlinear probability measures. The problem is shown to be a special case of a general stochastic optimization problem where the objective is to choose the terminal state of certain backward stochastic differential equations so as to minimize a g-expectation. The latter is solved with a stochastic maximum principle ap...
متن کاملDesign and Performance Analysis of Bayesian, Neyman-Pearson and Competitive Neyman-Pearson Voice Activity Detectors
In this paper, the Bayesian, Neyman-Pearson and Competitive Neyman-Pearson detection approaches are analyzed using a perceptually modified Ephraim-Malah (PEM) model, based on which a few practical voice activity detectors are developed. The voice activity detection is treated as a composite hypothesis testing problem with a free parameter formed by the prior signal-to-noise ratio (SNR). It is r...
متن کاملNeyman-Pearson Classification, Convexity and Stochastic Constraints
Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with high probability: (i) its probability of type I error is below a pre-specifie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1968
ISSN: 0022-247X
DOI: 10.1016/0022-247x(68)90167-4